The symmetries of the Dirac--Pauli equation in two and three dimensions

We calculate all symmetries of the Dirac-Pauli equation in two-dimensional and three-dimensional Euclidean space. Further, we use our results for an investigation of the issue of zero mode degeneracy. We construct explicitly a class of multiple zero modes with their gauge potentials.Comment: 22 pages, Latex. Final version as published in JMP. Contains an additional subsection (4.2) with the explicit construction of multiple zero mode

Conservation laws in Skyrme-type models

The zero curvature representation of Zakharov and Shabat has been generalized recently to higher dimensions and has been used to construct non-linear field theories which either are integrable or contain integrable submodels. The Skyrme model, for instance, contains an integrable subsector with infinitely many conserved currents, and the simplest Skyrmion with baryon number one belongs to this subsector. Here we use a related method, based on the geometry of target space, to construct a whole class of theories which are either integrable or contain integrable subsectors (where integrability means the existence of infinitely many conservation laws). These models have three-dimensional target space, like the Skyrme model, and their infinitely many conserved currents turn out to be Noether currents of the volume-preserving diffeomorphisms on target space. Specifically for the Skyrme model, we find both a weak and a strong integrability condition, where the conserved currents form a subset of the algebra of volume-preserving diffeomorphisms in both cases, but this subset is a subalgebra only for the weak integrable submodel.Comment: Latex file, 22 pages. Two (insignificant) errors in Eqs. 104-106 correcte

Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo codes suitable for nonergodic channels and recently reported in the literature.Comment: Submitted to the IEEE Transactions on Information Theor

Irregular Turbo Codes in Block-Fading Channels

We study irregular binary turbo codes over non-ergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes. We then show that, using these multiplexers, irregular turbo codes that exhibit a small decoding threshold over the ergodic Gaussian-noise channel perform very close to the outage probability on block-fading channels, from both density evolution and finite-length perspectives.Comment: to be presented at the IEEE International Symposium on Information Theory, 201